
\chapter{General idea how to play chess.}
Computer chess has been analyzed and developed for long time now. We use mostly (if not only)
well known algorithms. The game is played between two player. Moves are taken alternately.
That's why almost every chess programm uses some kind of MiniMax algorithm
(http://en.wikipedia.org/wiki/Minimax). So does our programm. We use in general the MiniMax 
with some heuristics. One thing is remebering the whole game graph. Because of that we have to
compute the evaluation function and the move generation for particular game state only once.
The game state evaluation function is generaly based on counting pieces that are left on board.
Every single piece of that type receives some predefined value.
